Clifford Regular Domains

Prüfer Domains with Clifford Class Semigroup

Bazzoni’s Conjecture states that the Prüfer domain R has finite character if and only if R has the property that an ideal of R is finitely generated if and only if it is locally principal. In [4] the authors use the language and results from the theory of lattice-ordered groups to show that the conjecture is true. In this article we supply a purely ring theoretic proof. 1. Bazzoni’s Conjecture ...

Domains Based on Regular Types ?

Domains Based on Regular Types ? John P. Gallagher and Kim S. Henriksen Computer Science, Building 42.1, P.O. Box 260, Roskilde University, DK-4000 Denmark Email: {jpg,kimsh}@ruc.dk Abstract. We show how to transform a set of regular type definitions into a finite pre-interpretation for a logic program. The derived preinterpretation forms the basis for an abstract interpretation. The core of th...

Existentially Closed R-domains in Regular Extensions

Clifford Wavelets and Clifford-valued MRAs

In this paper using the Clifford algebra over R4 and its matrix representation, we construct Clifford scaling functions and Clifford wavelets. Then we compute related mask functions and filters, which arise in many applications such as quantum mechanics.

Semi-Clifford and Generalized Semi-Clifford Operations

Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called Ck hierarchy gates, intro...